首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   245篇
  免费   3篇
  国内免费   18篇
化学   4篇
力学   9篇
数学   246篇
物理学   7篇
  2024年   1篇
  2023年   3篇
  2022年   8篇
  2021年   4篇
  2020年   4篇
  2019年   5篇
  2018年   10篇
  2017年   3篇
  2016年   6篇
  2015年   5篇
  2014年   9篇
  2013年   17篇
  2012年   13篇
  2011年   15篇
  2010年   10篇
  2009年   17篇
  2008年   9篇
  2007年   12篇
  2006年   6篇
  2005年   11篇
  2004年   8篇
  2003年   7篇
  2002年   9篇
  2001年   5篇
  2000年   5篇
  1999年   3篇
  1998年   3篇
  1997年   6篇
  1996年   6篇
  1995年   2篇
  1994年   4篇
  1993年   1篇
  1992年   1篇
  1991年   2篇
  1990年   4篇
  1988年   1篇
  1987年   4篇
  1986年   2篇
  1985年   3篇
  1984年   5篇
  1983年   1篇
  1982年   2篇
  1981年   2篇
  1980年   2篇
  1978年   2篇
  1977年   1篇
  1973年   1篇
  1971年   1篇
  1970年   2篇
  1969年   3篇
排序方式: 共有266条查询结果,搜索用时 31 毫秒
91.
Let H be a connected graph and G be a supergraph of H. It is trivial that for any k-flow (Df) of G, the restriction of (Df) on the edge subset E(G / H) is a k-flow of the contracted graph G / H. However, the other direction of the question is neither trivial nor straightforward at all: for any k-flow \((D',f')\) of the contracted graph G / H, whether or not the supergraph G admits a k-flow (Df) that is consistent with \((D',f')\) in the edge subset E(G / H). In this paper, we will investigate contractible configurations and their extendability for integer flows, group flows, and modulo orientations. We show that no integer flow contractible graphs are extension consistent while some group flow contractible graphs are also extension consistent. We also show that every modulo \((2k+1)\)-orientation contractible configuration is also extension consistent and there are no modulo (2k)-orientation contractible graphs.  相似文献   
92.
Over the last 30 years, researchers have investigated connections between dimension for posets and planarity for graphs. Here we extend this line of research to the structural graph theory parameter tree-width by proving that the dimension of a finite poset is bounded in terms of its height and the tree-width of its cover graph.  相似文献   
93.
Group Connectivity of 3-Edge-Connected Chordal Graphs   总被引:3,自引:0,他引:3  
Let A be a finite abelian group and G be a digraph. The boundary of a function f: E(G)ZA is a function ‘f: V(G)ZA given by ‘f(v)=~e leaving vf(e)m~e entering vf(e). The graph G is A-connected if for every b: V(G)ZA with ~v] V(G) b(v)=0, there is a function f: E(G)ZA{0} such that ‘f=b. In [J. Combinatorial Theory, Ser. B 56 (1992) 165-182], Jaeger et al showed that every 3-edge-connected graph is A-connected, for every abelian group A with |A|̈́. It is conjectured that every 3-edge-connected graph is A-connected, for every abelian group A with |A|̓ and that every 5-edge-connected graph is A-connected, for every abelian group A with |A|́.¶ In this note, we investigate the group connectivity of 3-edge-connected chordal graphs and characterize 3-edge-connected chordal graphs that are A-connected for every finite abelian group A with |A|́.  相似文献   
94.
95.
96.
97.
In this paper by using anL estimate for elliptic equations, we study the well-posedness of the stationary semiconductor equations arising from modeling a nondestructive testing technique LBIC. It is shown that when the extra source term is small, the system has a unique weak solution, and the solution is continuously dependent on this source term. The validity of an approximate model derived for the study of the inverse problem is established. The existence result is then extended to the case of constant mobilities without the assumption on the size of the source term.Parts of this work were completed while the authors were members of the Center for Applied Mathematical Sciences at the University of Southern California, and was supported by Air Force Office of Scientific Research Grant AFOSR-90-0091.  相似文献   
98.
We present a construction of an induced cycle in then-dimensional hypercubeI[n] (n2), and a subgroup n ofI[n] considered as the group 2 n , such that | n |16 and the induced cycle uses exactly one element of every coset of n . This proves that for anyn2 the vertices ofI[n] can be covered using at most 16 vertex-disjoint induced cycles.  相似文献   
99.
A number of modern mathematical and physical problems require the study of delicate asymptotic properties lying beyond the power series asymptotics. In this paper we suggest a link between these asymptotic problems and some analytic properties of inverse Laplace transforms of the corresponding solutions. The main result claims that these inverse transforms are holomorphic in an appropriately cut complex plane. A direct consequence of this is the nonexistence of solutions to the class of asymptotics beyond all orders problems, such as regular shocks of the Kuramoto-Sivashinsky equaiton ([Gr]), needle crystal solutions of the simple geometrical model of crystal growth ([KS]), solitary wave solutions to a class of the fifth-order Kortveg-de Vries equations ([KO, Sect.8], [GJ]), homoclinic orbits of some singularly perturbed mappings ([Ec, HM]) and others.Supported by a grant of the Ministry of Science and Technology of Israel.  相似文献   
100.
Diamond, Pomerance and Rubel (1981) proved that there are subsets of the complex plane such that for any two entire functions and if , then . Baraducci and Dikranjan showed in 1993 that the continuum hypothesis (CH) implies the existence of a similar set for the class of continuous nowhere constant functions from to , while it follows from the results of Burke and Ciesielski (1997) and Ciesielski and Shelah that the existence of such a set is not provable in ZFC. In this paper we will show that for several well-behaved subclasses of , including the class of differentiable functions and the class of absolutely continuous functions, a set with the above property can be constructed in ZFC. We will also prove the existence of a set with the dual property that for any if , then .

  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号